Multi-view subspace clustering via partition fusion

نویسندگان

چکیده

Multi-view clustering is an important approach for analyzing multi-view data in unsupervised way. Among various methods, the subspace has gained increasing attention due to its encouraging performance. Essentially, it integrates information into graphs, which are then fed spectral algorithm final results. However, performance may degrade noises existing each individual view or inconsistencies between heterogeneous features. Orthogonal current work, we propose fuse a partition space, enhances robustness of clustering. Specifically, generate multiple partitions and integrate them find shared partition. The proposed model unifies graph learning, generation basic partitions, weight learning. These three components co-evolve towards better quality outputs. We have conducted comprehensive experiments on benchmark datasets our empirical results verify effectiveness approach.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-view clustering via pairwise sparse subspace representation

Multi-view clustering, which aims to cluster datasets with multiple sources of information, has a wide range of applications in the communities of data mining and pattern recognition. Generally, it makes use of the complementary information embedded in multiple views to improve clustering performance. Recent methods usually find a low-dimensional embedding of multi-view data, but often ignore s...

متن کامل

Robust Localized Multi-view Subspace Clustering

In multi-view clustering, different views may have different confidence levels when learning a consensus representation. Existing methods usually address this by assigning distinctive weights to different views. However, due to noisy nature of realworld applications, the confidence levels of samples in the same viewmay also vary. Thus considering a unified weight for a view may lead to suboptim...

متن کامل

Multi-view low-rank sparse subspace clustering

Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data. This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. Relyi...

متن کامل

Multi-View Subspace Clustering via Relaxed L1-Norm of Tensor Multi-Rank

In this paper, we address the multi-view subspace clustering problem. Our method utilize the circulant algebra for tensor, which is constructed by stacking the subspace representation matrices of different views and then shifting, to explore the high order correlations underlying multi-view data. By introducing a recently proposed tensor factorization, namely tensor-Singular Value Decomposition...

متن کامل

A subspace co-training framework for multi-view clustering

0167-8655/$ see front matter 2013 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.patrec.2013.12.003 q This paper has been recommended for acceptance by Jesús Ariel Carrasco Ochoa. ⇑ Corresponding author. Tel.: +358 41 4996553. E-mail addresses: [email protected], [email protected] (X. Zhao), [email protected] (N. Evans), [email protected] (J.-L. Dugelay). Xuran Zhao ⇑, Nichol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Sciences

سال: 2021

ISSN: ['0020-0255', '1872-6291']

DOI: https://doi.org/10.1016/j.ins.2021.01.033